The Fermat-Weber Problem and Inner-Product Spaces

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The inverse Fermat-Weber problem

Given n points in the plane with nonnegative weights, the inverse Fermat-Weber problem consists in changing the weights at minimum cost such that a prespecified point in the plane becomes the Euclidean 1-median. The cost is proportional to the increase or decrease of the corresponding weight. In case that the prespecified point does not coincide with one of the given n points, the inverse Ferma...

متن کامل

On the Continuous Fermat-Weber Problem

We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand points. In particular, we consider versions of the “continuous k-median (Fermat-Weber) problem” where the goal is to select one or more center points that minimize the average distance to a set of points in a demand region. In such problems, the average is computed a...

متن کامل

$C^{*}$-semi-inner product spaces

In this paper, we introduce a generalization of Hilbert $C^*$-modules which are pre-Finsler modules, namely, $C^{*}$-semi-inner product spaces. Some properties and results of such spaces are investigated, specially the orthogonality in these spaces will be considered. We then study bounded linear operators on $C^{*}$-semi-inner product spaces.

متن کامل

Frames in 2-inner Product Spaces

In this paper, we introduce the notion of a frame in a 2- inner product space and give some characterizations. These frames can be considered as a usual frame in a Hilbert space, so they share many useful properties with frames.

متن کامل

The three-dimensional Fermat-Weber problem with Tchebychev distances

The three-dimensional Fermat-Weber facility location problem with Tchebychev distances is investigated. Expanding on previous research for the analogous two-dimensional problem, this study presents a new algorithm for solving the elusive three-dimensional case. The algorithm presented herein finds near optimal solutions in practical computational times. Some experimental results are also convey...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1994

ISSN: 0021-9045

DOI: 10.1006/jath.1994.1070